The theory of μ-lattices
نویسنده
چکیده
The concept of a μ-algebra for an equational theory T = 〈Ω, E〉 was introduced in [10]. If the underlying set of a T-algebra is a complete lattice and if the operations from Ω preserve the partial order, the existence of least and greatest fix-points makes it possible to interpret μ-terms, which are derived from the primitive ones in Ω by substitution and by two formal operations of taking fixpoints. More generally, if a partial order is definable by means of the operations and relations of T, as it is the case for the theory of lattices, the least and greatest fix-points can be axiomatised by means of implications between equations; in this abstract way we define a theory μ-T and a corresponding quasivariety of μ-T-algebras. It is well known fact that the investigation of free μ-T-algebras is equivalent to the investigation of the theory, at least if we are concerned with the equations which are satisfied in every model.
منابع مشابه
A characterization of multiwavelet packets on general lattices
The objective of this paper is to establish a complete characterization of multiwavelet packets associated with matrix dilation on general lattices $Gamma$ in $mathbb R^d$ by virtue of time-frequency analysis, matrix theory and operator theory.
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملThe Alternation Hierarchy for the Theory of Μ-lattices
The alternation hierarchy problem asks whether every μ-term φ, that is, a term built up also using a least fixed point constructor as well as a greatest fixed point constructor, is equivalent to a μ-term where the number of nested fixed points of a different type is bounded by a constant independent of φ. In this paper we give a proof that the alternation hierarchy for the theory of μ-lattices ...
متن کاملT-Rough Sets Based on the Lattices
The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کامل